Orthogonal polynomial solutions of linear ordinary differential equations
نویسندگان
چکیده
منابع مشابه
Puiseux Series Solutions of Ordinary Polynomial Differential Equations : Complexity Study
We prove that the binary complexity of solving ordinary polynomial differential equations in terms of Puiseux series is single exponential in the number of terms in the series. Such a bound was given in 1990 by Grigoriev for Riccatti differential polynomials associated to ordinary linear differential operators. In this paper, we get the same bound for arbitrary differential polynomials. The alg...
متن کاملLimit Behavior of Solutions of Ordinary Linear Differential Equations
A classification of classes of equivalent linear differential equations with respect to ω-limit sets of their canonical representatives is introduced. Some consequences of this classification to the oscillatory behavior of solution spaces are presented.
متن کاملNewton Polygons of Polynomial Ordinary Differential Equations
In this paper we show some properties of the Newton polygon of a polynomial ordinary differential equation. We give the relation between the Newton polygons of a differential polynomial and its partial derivatives. Newton polygons of evaluations of differential polynomials are also described.
متن کاملHomoclinic Solutions for Linear and Linearizable Ordinary Differential Equations
The problem (1.4), which is closely related to the problem of periodic solutions, has constituted the object of numerous fundamental studies; last year, a systematic study based on the theory of topological degree has been drawn up by J. Mawhin [17, 18, 19, 20]. In the cited works the reader can find a rich bibliography in this field. On the other hand, the existence of solutions of (1.1) such ...
متن کاملComputing with Polynomial Ordinary Differential Equations
In 1941, Claude Shannon introduced the General Purpose Analog Computer (GPAC) as a mathematical model of DiUerential Analysers, that is to say as a model of continuoustime analog (mechanical, and later on electronic) machines of that time. Following Shannon’s arguments, functions generated by the GPAC must satisfy a polynomial diUerential algebraic equation (DAE). As it is known that some compu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2001
ISSN: 0377-0427
DOI: 10.1016/s0377-0427(00)00636-1